On fine Selmer groups and the greatest common divisor of signed and chromatic

نویسندگان

چکیده

Let E / Q E/\mathbb {Q} be an elliptic curve and alttext="p"> p encoding="application/x-tex">p odd prime where E"> encoding="application/x-tex">E has good supersingular reduction. F 1"> F 1 encoding="application/x-tex">F_1 denote the characteristic power series of Pontryagin dual fine Selmer group over cyclotomic alttext="double-struck Z Subscript p"> mathvariant="double-struck">Z encoding="application/x-tex">\mathbb {Z}_p -extension let 2"> 2 encoding="application/x-tex">F_2 greatest common divisor Pollack’s plus minus -adic L"> L encoding="application/x-tex">L -functions or Sprung’s sharp flat attached to , depending on whether alttext="a p Baseline left-parenthesis right-parenthesis equals 0"> a ( stretchy="false">) = 0 encoding="application/x-tex">a_p(E)=0 not-equals ≠ encoding="application/x-tex">a_p(E)\ne 0 . We study a link between divisors in Iwasawa algebra. This gives new insights into problems posed by Greenberg Pollack–Kurihara these elements.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Greatest common divisor

In mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), highest common factor (hcf), or greatest commonmeasure (gcm), of two or more integers (when at least one of them is not zero), is the largest positive integer that divides the numbers without a remainder. For example, the GCD of 8 and 12 is 4.[1][2] This notion can be extended to polynomials, see ...

متن کامل

Multidimensional Greatest Common Divisor and Lehmer Algorithms

A class of multidimensional greatest common divisor algorithms is studied. Their connection with the Jacobi algorithm is established and used to obtain theoretical properties such as the existence of digit frequencies. A technique of D. H. Lehmer's for Euclid's algorithm is generalized for efficient computation of the multidimensional algorithms. For triples of integers, two algorithms of inter...

متن کامل

On primitive recursive algorithms and the greatest common divisor function

We establish linear lower bounds for the complexity of non-trivial, primitive recursive algorithms from piecewise linear given functions. The main corollary is that logtime algorithms for the greatest common divisor from such givens (such as Stein’s) cannot be matched in efficiency by primitive recursive algorithms from the same given functions. The question is left open for the Euclidean algor...

متن کامل

The complexity of greatest common divisor computations

We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal set of multipliers with respect to either the L0 metric or the L∞ norm. We present and analyze a new method for expressing the gcd of n numbers as their linear combination and give an upper bound on the size of the lar...

متن کامل

Euclid’s Algorithm for the Greatest Common Divisor

People have been using numbers, and operations on them like division, for a very long time for practical purposes like dividing up the money left by parents for children, or distributing ears of corn equally to groups of people, and more generally to conduct all sorts of business dealings. It may be a bit of a surprise that things like calculating divisors of numbers also form the core of today...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2021

ISSN: ['2330-1511']

DOI: https://doi.org/10.1090/proc/15480